A Family-Based Evolutional Approach for Kernel Tree Selection in SVMs
نویسندگان
چکیده
منابع مشابه
Degeneracy in model selection for SVMs with radial Gaussian kernel
We consider the model selection problem for support vector machines applied to binary classification. As the data generating process is unknown, we have to rely on heuristics as model section criteria. In this study, we analyze the behavior of two criteria, radius margin quotient and kernel polarization, applied to SVMs with radial Gaussian kernel. We proof necessary and sufficient conditions f...
متن کاملA Nonconformity Approach to Model Selection for SVMs
We investigate the issue of model selection and the use of the nonconformity (strangeness) measure in batch learning. Using the nonconformity measure we propose a new training algorithm that helps avoid the need for Cross-Validation or Leave-One-Out model selection strategies. We provide a new generalisation error bound using the notion of nonconformity to upper bound the loss of each test exam...
متن کاملFeature Selection for SVMs
We introduce a method of feature selection for Support Vector Machines. The method is based upon finding those features which minimize bounds on the leave-one-out error. This search can be efficiently performed via gradient descent. The resulting algorithms are shown to be superior to some standard feature selection algorithms on both toy data and real-life problems of face recognition, pedestr...
متن کاملAdaptive Gaussian Kernel SVMs
We consider binary classification using Support Vector Machines with Gaussian kernels: KΣ(xi, xj) = e −(xi−xj)′Σ−1(xi−xj) and address the problem of selecting a covariance matrix Σ which gives good classification performance. As with other nonparametric classification methods based on distances between data points (such as nearest neighbor and Parzen methods), the choice of distance function (Σ...
متن کاملA Tree-Based Kernel for Graphs
This paper proposes a new tree-based kernel for graphs. Graphs are decomposed into multisets of ordered Directed Acyclic Graphs (DAGs) and a family of kernels computed by application of tree kernels extended to the DAG domain. We focus our attention on the efficient development of one member of this family. A technique for speeding up the computation is given, as well as theoretical bounds and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2010
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e93.d.909